Performance evaluation of LU matrix decomposition using the SYCL standard
نویسندگان
چکیده
The object of this study is the performance SYCL standard tools when solving LU matrix decomposition problem. a fairly new technology for parallel computing in heterogeneous systems, so topic evaluating on specific tasks field relevant. In study, algorithm parallelized square was implemented by means and C++, an experiment conducted to test implementation system with several types processors. During testing, program received matrices various dimensions as input, output execution time schedule selected processor. obtained results, presented form tabular graphic data, show advantage over ordinary C++ more than 2 times using graphics It experimentally shown that almost not inferior speed executed central Such results are caused both high possibility parallelizing itself, great work developers its optimization. indicate speeding up solution similar algorithms systems processors optimized data parallelism. can be used justifying choice problems or parallelization scheme.
منابع مشابه
Sparse LU Decomposition using FPGA
This paper reports on an FPGA implementation of sparse LU decomposition. The resulting special purpose hardware is geared towards power system problems load flow computation which are typically solved iteratively using Newton Raphson. The key step in this process, which takes approximately 85% of the computation time, is the solution of sparse linear systems arising from the Jacobian matrices t...
متن کاملMulti-FPGA based High Performance LU Decomposition
LU Decomposition is a linear algebra routine that is used to bring down the complexity of solving a system of linear equations with multiple RHS. Its application can be found in computational physics (modeling 2-D structures), image processing, and computational chemistry (design and analysis of molecular structures). This paper investigates the hardware software co-design of large scale block-...
متن کاملPerformance Study of LU Decomposition on the Programmable GPU
With the increasing programmability of GPUs (graphics processing units), these units are emerging as an attractive computing platform not only for traditional graphics computation but also for general-purpose computation. In this paper, to study the performance of programmable GPUs, we describe the design and implementation of LU decomposition as an example of numerical computation. To achieve ...
متن کاملClassification using Efficient LU Decomposition in Sensornets
We consider the popular application of detection, classification and tracking and their feasibility in resource constrained sensornets. We concentrate on the classification aspect, by decomposing the complex, computationally intensive signal processing Maximum-APosterior (MAP) classifier into simpler computationally and communicationally load balanced procedures, using a clustering approach. LU...
متن کاملPricing American Options Using LU Decomposition
Numerical solution methods for pricing American options are considered. We propose a second-order accurate Runge-Kutta scheme for the time discretization of the Black-Scholes partial differential equation with an early exercise constraint. We reformulate the algorithm introduced by Brennan and Schwartz into a simple form using a LU decomposition and a modified backward substitution with a proje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Technology audit and production reserves
سال: 2023
ISSN: ['2664-9969', '2706-5448']
DOI: https://doi.org/10.15587/2706-5448.2023.284518